On the Directed Oberwolfach Problem with Equal Cycle Lengths
نویسندگان
چکیده
منابع مشابه
On the Directed Oberwolfach Problem with Equal Cycle Lengths
We examine the necessary and sufficient conditions for a complete symmetric digraph K n to admit a resolvable decomposition into directed cycles of length m. We give a complete solution for even m, and a partial solution for odd m.
متن کاملSome results on the Oberwolfach problem
The well-known Oberwolfach problem is to show that it is possible to 2-factorize Kn (n odd) or Kn less a 1-factor (n even) into predetermined 2-factors, all isomorphic to each other; a few exceptional cases where it is not possible are known. In this paper we introduce a completely new technique which enables us to show that there is a solution when each 2-factor consists of k r-cycles and one ...
متن کاملThe Even Cycle Problem for Directed Graphs
If each arc in a strongly connected directed graph of minimum in-degree and outdegree at least 3 is assigned a weight 0 or 1, then the resultingweighted directed graph has a directed cycle of even total weight. This provesa conjecture made by L. Lovasz in 1975 and has applications to colour-criticalhypergraphs, sign-nonsingular matrices, and permanents of matrices. MATHEMATICAL ...
متن کاملThe Oberwolfach Problem in Graph Theory
During the summer of 2007, I participated in a Research Experience for Undergraduates (REU) at Illinois State University. I was one of eight undergraduates, all of whom were mathematics education majors. During my eight week experience, we worked with four in-service teachers from the Normal-Bloomington area, as well as math and math education professors from Illinois State and surrounding univ...
متن کاملOberwolfach rectangular table negotiation problem
We completely solve certain case of a “two delegation negotiation” version of the Oberwolfach problem, which can be stated as follows. Let H(k, 3) be a bipartite graph with bipartition X = {x1, x2, . . . , xk}, Y = {y1, y2, . . . , yk} and edges x1 y1, x1 y2, xk yk−1, xk yk , and xi yi−1, xi yi , xi yi+1 for i = 2, 3, . . . , k − 1. We completely characterize all complete bipartite graphs Kn,n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2014
ISSN: 1077-8926
DOI: 10.37236/2982